Abstract State Processes
نویسندگان
چکیده
State Processes Tommaso Bolognesi and Egon Börger 1 CNR, ISTI, Pisa [email protected] 2 Università di Pisa, Dipartimento di Informatica, I-56125 Pisa, Italy
منابع مشابه
PREDICTION OF STATIC SOFTENING OF MICROALLOYED STEEL BY THE INTEGRATION OF FINITE ELEMENT MODEL WITH PHYSICALLY BASED STATE VARIABLE MODEL
Abstract Recovery and recrystallization phenomena and effects of microalloying elements on these phenomena are of great importance in designing thermomechanical processes of microalloyed steels. Thus, understanding and modeling of microstructure evolution during hot deformation leads to optimize the processing conditions and to improve the product properties. In this study, finite element...
متن کاملConstruction of Abstract State Graphs with PVS
In this paper, we propose a method for the automatic construction of an abstract state graph of an arbitrary system using the Pvs theorem prover. Given a parallel composition of sequential processes and a partition of the state space induced by predicates ' 1 ; :::;' ` on the program variables which deenes an abstract state space, we construct an abstract state graph, starting in the abstract i...
متن کاملTesting-Based Abstractions for Value-Passing Systems
This paper presents a framework for the abstract interpretation of processes that pass values. We define a process description language that is parameterized with respect to the set of values that processes may exchange and show that an abstraction over values induces an abstract semantics for processes. Our main results state that if the abstract value interpretation safely/optimally approxima...
متن کاملFormal Models for Communication-Based Design
Concurrency is an essential element of abstract models for embedded systems. Correctness and e ciency of the design depend critically on the way concurrency is formalized and implemented. Concurrency is about communicating processes. We introduce an abstract formal way of representing communication among processes and we show how to re ne this representation towards implementation. To this end,...
متن کاملDeciding Bisimulation-Like Equivalences with Finite-State Processes
We design a general method for proving decidability of bisimulationlike equivalences between infinite-state processes and finite-state ones. We apply this method to the class of PAD processes, which strictly subsumes PA and pushdown (PDA) processes, showing that a large class of bisimulation-like equivalences (including e.g. strong and weak bisimilarity) is decidable between PAD and finite-stat...
متن کامل